-
1 generalized inductive class
Математика: обобщённый индуктивный классУниверсальный англо-русский словарь > generalized inductive class
-
2 generalized inductive class
матем.English-Russian scientific dictionary > generalized inductive class
-
3 class
1) класс; разряд; категория || классифицировать2) качество; сорт3) класс, группа ( в учебном заведении)4) курс лекций, курс обучения• -
4 logic
-
5 limit
1) граница || ограничивать2) допуск3) порог; предел || устанавливать предел4) лимит || лимитировать5) мн. ч. интервал значений•down to the limit — в максимальной степени; до предела; предельно
limit approached from the left — мат. предел при стремлении переменной к точке слева
limit from the left — мат. предел слева
limit from the right — мат. предел справа
limit in probability — мат. предел по вероятности
limit in quadratic mean — мат. предел в среднеквадратическом смысле
limit in the mean — мат. предел в среднем
limit on the left — мат. предел слева
limit on the right — мат. предел справа
passage to the limit — мат. предельный переход
proceeding to limit — мат. переход к пределу
to tend to limit — мат. стремиться к пределу
to take limit — мат. найти предел
to set the limit to — устанавливать предел (чего-л.)
- almost significant limit - lower control limit - upper control limitto proceed [pass] to limit — мат. переходить к пределу
См. также в других словарях:
Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… … Wikipedia
Brouwer-Hilbert controversy — A foundational controversy in twentieth century history of mathematics opposed L. E. J. Brouwer, a supporter of intuitionism, and David Hilbert, the founder of formalism.BackgroundThe background for the controversy was set with David Hilbert s… … Wikipedia
metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… … Universalium
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
geography — /jee og reuh fee/, n., pl. geographies. 1. the science dealing with the areal differentiation of the earth s surface, as shown in the character, arrangement, and interrelations over the world of such elements as climate, elevation, soil,… … Universalium
Memristor — Type Passive Working principle Memristance Invented Leon Chua (1971) First production HP Labs (2008) Electronic symbol … Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
Statistical inference — In statistics, statistical inference is the process of drawing conclusions from data that are subject to random variation, for example, observational errors or sampling variation.[1] More substantially, the terms statistical inference,… … Wikipedia
Constructible universe — Gödel universe redirects here. For Kurt Gödel s cosmological solution to the Einstein field equations, see Gödel metric. In mathematics, the constructible universe (or Gödel s constructible universe), denoted L, is a particular class of sets… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia